Reproof of a theorem on duality without convexity
نویسندگان
چکیده
منابع مشابه
SDCA without Duality, Regularization, and Individual Convexity
Stochastic Dual Coordinate Ascent is a popular method for solving regularized loss minimization for the case of convex losses. We describe variants of SDCA that do not require explicit regularization and do not rely on duality. We prove linear convergence rates even if individual loss functions are non-convex, as long as the expected loss is strongly convex.
متن کاملA Viro Theorem without Convexity Hypothesis for Trigonal Curves
A cumbersome hypothesis for Viro patchworking of real algebraic curves is the convexity of the given subdivision. It is an open question in general to know whether the convexity is necessary. In the case of trigonal curves we interpret Viro method in terms of dessins d’enfants. Gluing the dessins d’enfants in a coherent way we prove that no convexity hypothesis is required to patchwork such cur...
متن کاملAn Analysis and a Reproof of Hmelevskii's Theorem
We analyze and reprove the famous theorem of Hmelevskii, which states that the general solutions of constant-free equations on three unknowns are finitely parameterizable, that is expressible by a finite collection of formulas of word and numerical parameters. The proof is written, and simplified, by using modern tools of combinatorics on words. As a new aspect the size of the finite representa...
متن کاملOn difference sequence spaces defined by Orlicz functions without convexity
In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.
متن کاملConvexity, Duality and Effects
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. These relationships take the form of three adjunctions. Two of these three are ‘dual’ adjunctions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1970
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90091-0